On chromaticity of hypergraphs
نویسندگان
چکیده
Let H = (X,E) be a simple hypergraph and let f (H, ) denote its chromatic polynomial. Two hypergraphs H1 and H2 are chromatic equivalent if f (H1, ) = f (H2, ). The equivalence class of H is denoted by 〈H 〉. Let K and H be two classes of hypergraphs.H is said to be chromatically characterized in K if for every H ∈ H ∩K we have 〈H 〉 ∩K=H ∩K. In this paper we prove that uniform hypertrees and uniform unicyclic hypergraphs are chromatically characterized in the class of linear hypergraphs. © 2006 Elsevier B.V. All rights reserved.
منابع مشابه
On the Chromaticity of Multi-Bridge Hypergraphs
A multi-bridge hypergraph is an h-uniform linear hypergraph consisting of some linear paths having common extremities. In this paper it is proved that the multisets of path lengths of two chromatically equivalent multi-bridge hypergraphs are equal provided the multiplicities of path lengths are bounded above by 2h−1 − 2. ∗This research is partially supported by Abdus Salam School of Mathematica...
متن کاملOn the chromaticity of sunflower hypergraphs SH(n, p, h)
A sunflower hypergraph SH(n, p, h) is an h-hypergraph of order n = h + (k − 1)p and size k (1 p h − 1 and h 3), where each edge (or a “petal”) consists of p distinct vertices and a common subset to all edges with h−p vertices. In this paper, it is shown that this hypergraph is h-chromatically unique (i.e., chromatically unique in the set of all h-hypergraphs) for every 1 p h − 2, but this is no...
متن کاملSome Results on Chromaticity of Quasi-Linear Paths and Cycles
Let r > 1 be an integer. An h-hypergraph H is said to be r-quasi-linear (linear for r = 1) if any two edges of H intersect in 0 or r vertices. In this paper it is shown that r-quasi-linear paths P h,r m of length m > 1 and cycles C h,r m of length m > 3 are chromatically unique in the set of h-uniform r-quasi-linear hypergraphs provided r > 2 and h > 3r − 1.
متن کاملON THE NORMALITY OF t-CAYLEY HYPERGRAPHS OF ABELIAN GROUPS
A t-Cayley hypergraph X = t-Cay(G; S) is called normal for a finite group G, if the right regular representationR(G) of G is normal in the full automorphism group Aut(X) of X. In this paper, we investigate the normality of t-Cayley hypergraphs of abelian groups, where S < 4.
متن کاملA new result on chromaticity of K4-homoemorphs with girth 9
For a graph $G$, let $P(G,lambda)$ denote the chromatic polynomial of $G$. Two graphs $G$ and $H$ are chromatically equivalent if they share the same chromatic polynomial. A graph $G$ is chromatically unique if any graph chromatically equivalent to $G$ is isomorphic to $G$. A $K_4$-homeomorph is a subdivision of the complete graph $K_4$. In this paper, we determine a family of chromatically uni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 307 شماره
صفحات -
تاریخ انتشار 2007